Optimal Transmission Probability in Binary Molecular Communication
نویسندگان
چکیده
منابع مشابه
optimal joint survival probability of xl reinsurance contracts in iran insurance company
اگر تنها یک صنعت جهت حفظ تعادل در بازار جهانی ضروری باشد، می توان ادعا نمود که آن صنعت بیمه است. صنعت بیمه بدون کمک صنعت بیمه اتکایی قادر به انجام وظیفه خویش نخواهد بود. اکثر تحقیقات انجام گرفته در زمینه بیمه اتکایی تنها با در نظر گرفتن منافع شرکت بیمه شده بوده است و منافع شرکت بیمه گر اتکایی کمتر مورد توجه بوده است. در این رساله با در نظر گرفتن منافع همزمان هر دو شرکت بیمه گذار اصلی و بیمه گر ...
15 صفحه اولOptimal binary communication with nonequal probabilities
Optimal signal energies are derived for optimal binary digital communication systems with arbitrary signal probabilities and correlation with both coherent and noncoherent detection. The resulting bit-error probability (BEP) is computed and compared with the BEP of the same systems with equal signal energies. One of the conclusions is that for the coherent system with nonegative correlation, an...
متن کاملBinary Communication in Entangled Channels
We analyze optical binary communication assisted by entanglement and show that: i) ideal entangled channels have smaller error probability than ideal single-mode coherent channels if the photon number of the channel is larger than one; ii) realistic entangled channels with heterodyne receivers have smaller error probability than ideal single-mode coherent channels if the photon number of the ch...
متن کاملSecond order phase transition in neural rate coding: binary encoding is optimal for rapid signal transmission.
Here, we derive optimal tuning functions for minimum mean square reconstruction from neural rate responses subjected to Poisson noise. The shape of these tuning functions strongly depends on the length T of the time window within which action potentials (spikes) are counted in order to estimate the underlying firing rate. A phase transition towards pure binary encoding occurs if the maximum mea...
متن کاملEfficient and optimal binary Hopfield associative memory storage using minimum probability flow
We present an algorithm to store binary memories in a Hopfield neural network using minimum probability flow, a recent technique to fit parameters in energybased probabilistic models. In the case of memories without noise, our algorithm provably achieves optimal pattern storage (which we show is at least one pattern per neuron) and outperforms classical methods both in speed and memory recovery...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2013
ISSN: 1089-7798
DOI: 10.1109/lcomm.2013.041813.130255